Spatial chromatic tessellation: conception, interpretation, and implication
نویسندگان
چکیده
A novel spatial tessellation scheme, spatial chromatic tessellation (SCT), is proposed for representing and exploring space– entity relationship. The objective of this article is briefly introducing the basic concepts, structure, and properties of SCT. Our study mainly focuses on the arranged chromatic diagram (ACD), which is the most typical type of SCT. A few examples show that ACD can be used to analyze spatial topology, statistics, computations, database, and Voronoi diagrams. ACD also contains many implications on spatial analysis theory. With respect to each entity in a space, SCT partitions the space into a number of small unit cells and gives each cell a unique chromatic code. The spatial topological relationships among these cells are able to be represented and computed by their codes. Based on the different statistical rules on cellular codes, cells could be merged into larger clusters, such as a variety of Voronoi diagrams. Moreover, because cells are coded with the same data structure, it is easy to store and manage these codes in relational database, and then any spatial analytical operation could be realized simply by structured queries. SCT establishes a basic framework that not only provides a theoretical tool for spatial analysis and computations but also helps us to understand the space–entity relationship insightfully.
منابع مشابه
Entity-oriented spatial coding and discrete topological spatial relations
Based on a newly proposed spatial data model – spatial chromatic model (SCM), we developed a spatial coding scheme, called full-coded ordinary arranged chromatic diagram (full-OACD). Full-OACD is a type of spatial tessellation, where space is partitioned into a number of subspaces such as cells, edges, and vertexes. These subspaces are called spatial particles and assigned with unique codes – c...
متن کاملThe graph tessellation cover number: extremal bounds, efficient algorithms and hardness
A tessellation of a graph is a partition of its vertices into vertex disjoint cliques. A tessellation cover of a graph is a set of tessellations that covers all of its edges. The t-tessellability problem aims to decide whether there is a tessellation cover of the graph with t tessellations. This problem is motivated by its applications to quantum walk models, in especial, the evolution operator...
متن کاملDynamical geometry for multiscale dissipative particle dynamics
In this paper, we review the computational aspects of a multiscale dissipative particle dynamics model for complex fluid simulations based on the feature-rich geometry of the Voronoi tessellation. The geometrical features of the model are critical since the mesh is directly connected to the physics by the interpretation of the Voronoi volumes of the tessellation as coarse-grained fluid clusters...
متن کاملThe tessellation problem of quantum walks
Quantum walks have received a great deal of attention recently because they can be used to develop new quantum algorithms and to simulate interesting quantum systems. In this work, we focus on a model called staggered quantum walk, which employs advanced ideas of graph theory and has the advantage of including the most important instances of other discrete-time models. The evolution operator of...
متن کاملConceptions of Logical Implication*
This is a survey paper of approaches to the concept of logical implication. Roughly stated the main motivation of these approaches is to provide a necessary and sufficient condition for a set of propositions to logically imply a single proposition. In regard to their affinities these approaches are grouped into two: the transformational conception and the informational conception. Some approach...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals of GIS
دوره 16 شماره
صفحات -
تاریخ انتشار 2010